Estimation-based metaheuristics for the probabilistic traveling salesman problem
نویسندگان
چکیده
منابع مشابه
Estimation-based metaheuristics for the probabilistic traveling salesman problem
The probabilistic traveling salesman problem (PTSP) is a central problem in stochastic routing. Recently, we have shown that empirical estimation is a promising approach to devise highly effective local search algorithms for the PTSP. In this paper, we customize two metaheuristics, an iterated local search algorithm and a memetic algorithm, to solve the PTSP. This customization consists in adop...
متن کاملAn Experimental Study of Estimation-based Metaheuristics for the Probabilistic Traveling Salesman Problem
The probabilistic traveling salesman problem (PTSP), a paradigmatic example of a stochastic combinatorial optimization problem, is used to study routing problems under uncertainty. Recently, we introduced a new estimation-based iterative improvement algorithm for the PTSP and we showed that it outperforms for a number of instance classes the previous state-of-the-art algorithms. In this paper, ...
متن کاملEstimation-based Local Search for the Probabilistic Traveling Salesman Problem
In this paper, we propose an effective local search algorithm that makes use of empirical estimation techniques for a class of stochastic combinatorial optimization problems. We illustrate our approach and assess its performance on the probabilistic traveling salesman problem. Experimental results on a large set of instances show that our approach is very competitive.
متن کاملAggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowest expected final tour cost. The PTSP is an important 7 problem, both operationally and strategically, but is quite difficult to solve with realistically sized problem instances. One alternative is to aggregate custome...
متن کاملCharacterization of the probabilistic traveling salesman problem.
We show that stochastic annealing can be successfully applied to gain new results on the probabilistic traveling salesman problem. The probabilistic "traveling salesman" must decide on an a priori order in which to visit n cities (randomly distributed over a unit square) before learning that some cities can be omitted. We find the optimized average length of the pruned tour follows E(L(pruned))...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2010
ISSN: 0305-0548
DOI: 10.1016/j.cor.2009.12.005